A result on flip - graph connectivity

نویسنده

  • Lionel Pournin
چکیده

A polyhedral subdivision of a d-dimensional point configuration A is k-regular if it is projected from the boundary complex of a polytope with dimension at most d+k. Call γk(A) the subgraph induced by k-regular triangulations in the flip-graph of A. Gel’fand, Kapranov, and Zelevinsky have shown that γ1(A) is connected. It is established here that γ2(A) is connected as well. 1. Flip-graph connectivity and regular subdivisions Let A be a d-dimensional point configuration, that is a finite subset of R whose affine hull has dimension d. A polyhedral subdivision of A is a collection S of subsets of A so that {conv(s) : s ∈ S} is a polyhedral complex and ∪s∈Sconv(s) is exactly conv(A). In this paper, the set ω(A) of all subdivisions of A will be partially ordered by the following refinement relation: a subdivision S refines another subdivision S′ if every face of S is a subset of some face of S′. A first remarkable subposet of ω(A) is the flip-graph of A, made up of the minimal and next-to-minimal elements of ω(A), and denoted by γ(A) in the following. Observe that the minimal elements in ω(A) are precisely the triangulations of A. Its next-to-minimal elements will be called flips according to the definition found in [19] (definition 4.7.) and [21] (remark 1.17.). This definition identifies flips within the refinement poset of a point configuration, but other equivalent definitions are possible [18,19,21]. In particular, it is more usual to define flips not as subdivisions, but as local operations instead that transform a triangulation of a point configuration into another one. The flip-graph of a point configuration A then is the graph whose vertices are the triangulations of A and whose edges are its flips. While this definition is equivalent to the one above [18,21], it better shows that flips are also used to build triangulations incrementally [8,12]. The connectivity of the flip-graph then arises as a natural question: is it always possible to transform a triangulation of a point configuration into Mathematics Institute, Ecole Polytechnique Fédérale de Lausanne, 1015 Lausanne, Switzerland. Present address: EFREI, 30-32 avenue de la République, 94800 Villejuif, France e-mail: [email protected]

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A note on connectivity and lambda-modified Wiener index

In theoretical chemistry, -modified Wiener index is a graph invariant topological index to analyze the chemical properties of molecular structure. In this note, we determine the minimum -modified Wiener index of graph with fixed connectivity or edge-connectivity. Our results also present the sufficient and necessary condition for reaching the lower bound.

متن کامل

On the Szeged and Eccentric connectivity indices of non-commutative graph of finite groups

Let $G$ be a non-abelian group. The non-commuting graph $Gamma_G$ of $G$ is defined as the graph whose vertex set is the non-central elements of $G$ and two vertices are joined if and only if they do not commute.In this paper we study some properties of $Gamma_G$ and introduce $n$-regular $AC$-groups. Also we then obtain a formula for Szeged index of $Gamma_G$ in terms of $n$, $|Z(G)|$ and $|G|...

متن کامل

Arc Diagrams, Flip Distances, and Hamiltonian Triangulations

We show that every triangulation (maximal planar graph) on n 6 vertices can be flipped into a Hamiltonian triangulation using a sequence of less than n/2 combinatorial edge flips. The previously best upper bound uses 4-connectivity as a means to establish Hamiltonicity. But in general about 3n/5 flips are necessary to reach a 4-connected triangulation. Our result improves the upper bound on the...

متن کامل

Applications of Fuzzy Program Graph in Symbolic Checking of Fuzzy Flip-Flops

All practical digital circuits are usually a mixture of combinational and sequential logic. Flip–flops are essential to sequential logic therefore fuzzy flip–flops are considered to be among the most essential topics of fuzzy digital circuit. The concept of fuzzy digital circuit is among the most interesting applications of fuzzy sets and logic due to the fact that if there has to be an ultimat...

متن کامل

On Second Atom-Bond Connectivity Index

The atom-bond connectivity index of graph is a topological index proposed by Estrada et al. as ABC (G)  uvE (G ) (du dv  2) / dudv , where the summation goes over all edges of G, du and dv are the degrees of the terminal vertices u and v of edge uv. In the present paper, some upper bounds for the second type of atom-bond connectivity index are computed.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011